Counting Disconnected Structures
نویسندگان
چکیده
When counting isomers with a given number of atoms one usually assumes that we want to count (connected) molecules. In this note we present a method that can be used for counting disconnected structures if counts of connected structures are given. The method can be used also in the reverse direction. If the numbers of all structures are known, the number of connected structures can be readily determined.
منابع مشابه
Lecture 11: October 4 11.1 Network Reliability
Consider a connected undirected graph G with n vertices and m edges, where each edge has some probability p of failing. What is the probability that G becomes disconnected under random, independent edge failures? This can also be viewed as a counting problem, except that each item now has an associated weight: in particular, we want to compute the sum of the weights of all disconnected subgraph...
متن کاملConcerning the frame of minimal prime ideals of pointfree function rings
Let $L$ be a completely regular frame and $mathcal{R}L$ be the ring of continuous real-valued functions on $L$. We study the frame $mathfrak{O}(Min(mathcal{R}L))$ of minimal prime ideals of $mathcal{R}L$ in relation to $beta L$. For $Iinbeta L$, denote by $textit{textbf{O}}^I$ the ideal ${alphainmathcal{R}Lmidcozalphain I}$ of $mathcal{R}L$. We show that sending $I$ to the set of minimal prime ...
متن کاملCounting on Anonymous Dynamic Networks through Energy Transfer
This paper addresses the problem of counting the size of a network where (i) processes have the same identifiers (anonymous nodes) and (ii) the network topology constantly changes (dynamic network). Changes are driven by a powerful adversary that can look at internal process states and add and remove edges in order to contrast the convergence of the algorithm to the correct count. The paper pro...
متن کاملCausality, Influence, and Computation in Possibly Disconnected Synchronous Dynamic Networks
In this work, we study the propagation of influence and computation in dynamic networks that are possibly disconnected at every instant. We focus on a synchronous message passing communication model with broadcast and bidirectional links. To allow for bounded end-to-end communication we propose a set of minimal temporal connectivity conditions that bound from the above the time it takes for inf...
متن کاملLGM: Mining Frequent Subgraphs from Linear Graphs
A linear graph is a graph whose vertices are totally ordered. Biological and linguistic sequences with interactions among symbols are naturally represented as linear graphs. Examples include protein contact maps, RNA secondary structures and predicate-argument structures. Our algorithm, linear graph miner (LGM), leverages the vertex order for efficient enumeration of frequent subgraphs. Based o...
متن کامل